Computational complexity theory - PDFSEARCH.IO - Document Search Engine

Computational complexity theory
Results: 2049

#	Item
621	Algorithms: Complexity Classes and Lower Bounds Martin Held FB Computerwissenschaften Universität Salzburg A-5020 Salzburg, Austria Add to Reading List Source URL: www.cosy.sbg.ac.at Language: English - Date: 2014-10-17 01:42:07 Complexity classes P versus NP problem NP P Low EXPTIME NC Parameterized complexity Karp–Lipton theorem Theoretical computer science Computational complexity theory Applied mathematics
622	Draft of 16 Apr:30 a.m. The Guruswam-Sudan Decoding Algorithm for Reed-Solomon Codes. R. J. McEliece Add to Reading List Source URL: www.systems.caltech.edu Language: English - Date: 2003-04-16 20:16:24 Error detection and correction Algebra Polynomials Finite fields Computational complexity theory List decoding Reed–Solomon error correction Monomial order Monomial Coding theory Abstract algebra Mathematics
623	All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns Ron Adany1 , Moran Feldman2 , Elad Haramaty2 , Rohit Khandekar3 , Baruch Schieber4 , Roy Schwartz5 , Hadas Shachnai2 , and Tami T Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2013-01-05 09:50:09 Complexity classes Approximation algorithms NP-complete problems Matroid theory Generalized assignment problem Knapsack problem Submodular set function APX Polynomial-time approximation scheme Theoretical computer science Computational complexity theory Applied mathematics
624	Faster Construction of Planar Two-centers David Eppstein∗ Abstract tical implementation. The method is complicated, and Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 1997-12-08 20:38:05 Analysis of algorithms Computational geometry Probabilistic complexity theory Randomized algorithm Algorithm Time complexity Binary search algorithm LP-type problem Closest pair of points problem Theoretical computer science Applied mathematics Mathematics
625	System Behaviors and Measures: Compressed State Complexity and Number of Unique States Used in Naval Weapons Elevators Add to Reading List Source URL: www.complex-systems.com Language: English - Date: 2014-05-30 12:15:58 Structure Applied mathematics Computational complexity theory Finite model theory Complexity Complex systems Physical system FO Algorithm Systems Science Complex systems theory
626	CCCG 2010, Winnipeg MB, August 9–11, 2010 Constrained k-center and Movement to Independence Adrian Dumitrescu∗ Abstract Add to Reading List Source URL: cccg.ca Language: English - Date: 2010-07-19 10:46:19 Operations research NP-complete problems Approximation algorithm Computational complexity theory Facility location Circle Travelling salesman problem Tower of Hanoi Theoretical computer science Geometry Mathematics
627	Computing on Encrypted Data Secure Internet of Things Seminar David Wu January, 2015 New Applications in the Internet of Things Add to Reading List Source URL: iot.stanford.edu Language: English - Date: 2015-01-12 23:28:56 Secure multi-party computation Homomorphic encryption Computational complexity theory Computing Boolean circuit Circuit Mathematics Verifiable computing Secure two-party computation Cryptographic protocols Cryptography Applied mathematics
628	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Approximating k-hop Minimum Spanning Trees in Euclidean Metrics S¨oren Laue∗ Abstract Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:24:48 Operations research Spanning tree Complexity classes NP-complete problems Minimum spanning tree Steiner tree problem R-tree Approximation algorithm Polynomial-time approximation scheme Theoretical computer science Computational complexity theory Applied mathematics
629	Succinct Randomized Encodings and their Applications∗ Nir Bitansky† Sanjam Garg‡ Huijia Lin§ Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2015-04-21 11:01:51 Complexity classes EXPTIME P/poly Time complexity PP NL P NC Theoretical computer science Computational complexity theory Applied mathematics
630	Packing Resizable Items with Application to Video Delivery over Wireless Networks∗ Sivan Albagli-Kim† Leah Epstein‡ Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2012-07-08 12:40:54 NP-complete problems Operations research Combinatorial optimization Bin packing problem Knapsack problem Packing problem Algorithm Theoretical computer science Computational complexity theory Mathematics

UPDATE